Frameproof Codes Based on The Generalized Difference Function Families
نویسندگان
چکیده
منابع مشابه
Dynamic frameproof codes
There are many schemes in the literature for protecting digital data from piracy by the use of digital fingerprinting, such as frameproof codes, which prevent traitorous users from colluding to frame an innocent user, and traitortracing schemes, which enable the identification of users involved in piracy. The concept of traitor tracing has been applied to a digital broadcast setting in the form...
متن کاملOn tight bounds for binary frameproof codes
In this paper, we study w-frameproof codes, which are equivalent to {1, w}-separating hash families. Our main results concern binary codes, which are defined over an alphabet of two symbols. For all w ≥ 3, and for w + 1 ≤ N ≤ 3w, we show that an SHF(N ;n, 2, {1, w}) exists only if n ≤ N , and an SHF(N ;N, 2, {1, w}) must be a permutation matrix of degree N .
متن کاملSequential and dynamic frameproof codes
There are many schemes in the literature for protecting digital data from piracy by the use of digital fingerprinting, such as frameproof codes and traitor-tracing schemes. The concept of traitor tracing has been applied to a digital broadcast setting in the form of dynamic traitor-tracing schemes and sequential traitor-tracing schemes, which could be used to combat piracy of pay-TV broadcasts,...
متن کاملSliding-window dynamic frameproof codes
A sliding-window dynamic frameproof code is a scheme for discouraging the piracy of digital broadcasts through the use of digital fingerprinting. In this paper we formally define sliding-window dynamic frameproof codes and provide optimal constructions for a certain class of these schemes. We also discuss bounds on the number of users such schemes
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Wireless and Microwave Technologies
سال: 2011
ISSN: 2076-1449,2076-9539
DOI: 10.5815/ijwmt.2011.05.01